Minimization of Number of Tool Switching Instants in Automated Manufacturing Systems

This study addresses the problem of minimizing tool switching instants in automated manufacturing systems. There exist a single machine and group jobs to be processed on it. Each job requires set tools, due limited magazine capacity, because it is not possible load all available tools machine, must switched. The ultimate goal, this framework, minimize total number instants. We provide mathematical programming model two constraint models for problem. Because proven NP-hard, we develop heuristic approaches, compare their performance with methods described literature. Our analysis indicates that our perform relatively well solution quality execution time small-sized instances. greedy approach shows potential, reaching optimal 82.5% also statistically demonstrate search algorithm enhances obtained by heuristic, particularly large sets. Hence, approach, i.e., proposed able quickly reach near-optimal solutions, showing method appropriate settings requiring sudden adjustments.